Time-Abstracted Bisimulation: Implicit Specifications and Decidability
نویسندگان
چکیده
منابع مشابه
Time-abstracted Bisimulation: Implicit Specifications and Decidability
In the last few years a number of real{time process calculi have emerged with the purpose of capturing important quantitative aspects of real{time systems. In addition, a number of process equivalences sensitive to time{quantities have been proposed, among these the notion of timed (bisimulation) equivalence in RR86, DS89, HR91, BB89, NRSV90, MT90, Wan91b]. In this paper, we introduce a time{ab...
متن کاملBisimulation Quantified Modal Logics: Decidability
Bisimulation quantifiers are a natural extension of modal logics. They preserve the bisimulation invariance of modal logic, while allowing monadic second-order expressivity. Unfortunately, it is not the case that extension by bisimulation quantifiers always preserves the decidability of a modal logic. Here we examine a general class of modal logics for which decidability is preserved under exte...
متن کاملProcess Algebra, CCS, and Bisimulation Decidability
Over the past fifteen years, there has been intensive study of formal systems that can model concurrency and communication. Two such systems are the Calculus of Communicating Systems, and the Algebra of Communicating Processes. The objective of this paper has two aspects; (1) to study the characteristics and features of these two systems, and (2) to investigate two interesting formal proofs con...
متن کاملDecidability of Bisimulation Equivalence for Pushdown Processes
We show that bisimulation equivalence is decidable for pushdown automata without ǫ-transitions.
متن کاملInductive Decidability Using Implicit Induction
Decision procedures are widely used in automated reasoning tools in order to reason about data structures. In applications, many conjectures fall outside the theory handled by a decision procedure. Often, reasoning about user-defined functions on those data structures is needed. For this, inductive reasoning has to be employed. In this work, classes of function definitions and conjectures are i...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information and Computation
سال: 1997
ISSN: 0890-5401
DOI: 10.1006/inco.1997.2623